Numerical integration over polygons using an eight-node quadrilateral spline finite element
نویسندگان
چکیده
منابع مشابه
Applications of Gauss-Radau and Gauss-Lobatto Numerical Integrations Over a Four Node Quadrilateral Finite Element
In this paper Gauss-Radau and Gauss-Lobatto quadrature rules are presented to evaluate the rational integrals of the element matrix for a general quadrilateral. These integrals arise in finite element formulation for second order Partial Differential Equation via Galerkin weighted residual method in closed form. Convergence to the analytical solutions and efficiency are depicted by numerical ex...
متن کاملNumerical integration using spline quasi-interpolants
In this paper, quadratic rules for obtaining approximate solution of definite integrals as well as single and double integrals using spline quasi-interpolants will be illustrated. The method is applied to a few test examples to illustrate the accuracy and the implementation of the method.
متن کاملnumerical integration using spline quasi-interpolants
in this paper, quadratic rules for obtaining approximate solution of definite integrals as well as single and double integrals using spline quasi-interpolants will be illustrated. the method is applied to a few test examples to illustrate the accuracy and the implementation of the method
متن کاملNumerical integrations over an arbitrary quadrilateral region
In this paper, double integrals over an arbitrary quadrilateral are evaluated exploiting finite element method. The physical region is transformed into a standard quadrilateral finite element using the basis functions in local space. Then the standard quadrilateral is subdivided into two triangles, and each triangle is further discretized into 4 n right isosceles triangles, with area 1 2n2, and...
متن کاملGauss-Green cubature over spline curvilinear polygons
We have implemented in Matlab a Gauss-like cubature formula over bivariate domains with a piecewise regular boundary, which is tracked by splines of maximum degree p (spline curvilinear polygons). The formula is exact for polynomials of degree at most 2n− 1 using N ∼ cmn nodes, 1 ≤ c ≤ p, m being the total number of points given on the boundary. It does not need any decomposition of the domain,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2009
ISSN: 0377-0427
DOI: 10.1016/j.cam.2009.07.017